Steiner trees and spanning trees in six-pin soap films
نویسندگان
چکیده
Abstract We have studied the Steiner tree problem using six-pin soap films in detail. We extend the existing method of experimental realisation of Steiner trees in n-terminal problem through soap films to observe new non-minimal Steiner trees. We also produced spanning tree configurations for the first time by our method. Experimentally, by varying the pin diameter, we have achieved these new stable soap film configurations. A new algorithm is presented for creating these Steiner trees theoretically. Exact lengths of these Steiner tree configurations are calculated using a geometrical method. An exact two-parameter empirical formula is proposed for estimating the lengths of these soap film configurations in six-pin soap film problem.
منابع مشابه
Approaching P=NP: Can Soap Bubbles Solve The Steiner Tree Problem In Polynomial Time?
Computation theory folklore has it that soap films calculate Steiner trees. If true, this would imply P=NP. However, no rigorous physical experimentation has been performed on the matter. Indeed, such experimentation would be difficult to establish standards for. Furthermore, popular opinion has it that since soap films are classical physics objects [2], this verifies a physical version of the ...
متن کاملStatistical Alignment via k-Restricted Steiner Trees
When relating a set of sequences by a phylogeny, we are essentially constructing a Steiner tree connecting the sequences in the space of all finite sequences. Finding an optimal Steiner tree is in most formulations hard, so population genetics and phylogenetics have often used spanning trees as an approximation for computational expediency. In this assessment you will be asked to investigate an...
متن کاملBottleneck Distances and Steiner Trees in the Euclidean d-Space
Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-dimensional space, d ≥ 2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain low cost trees spanning all terminals. The weakness of this approach is that o...
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0806.1340 شماره
صفحات -
تاریخ انتشار 2008